Mechanisms for Parallel Query Execution
نویسندگان
چکیده
Parallel query processing has attained a lot of attention in the database community because customer applications on databases are growing in size and complexity with an ever increasing demand for performance. The main objective of parallel query processing is to achieve speedup, scaleup and high throughput. Earlier bracket model was used for parallelization. In case of bracket model it is not possible to possible to execute two operators in one process without resorting to some thread or coroutine facility. Also bracket model involves expensive interprocess communication system calls even in the cases when an entire query is evaluated on a single CPU. To overcome all these difficulties of bracket model we have developed a new model in which a single operator is used for parallelization. As compared to bracket model, all issues of control are localized in one operator (parallelizing operator) in this model. Also we can execute a complex query in a single or with a number of processes by using one or more parallelism operators in the query evaluation plan.
منابع مشابه
Dynamic Aspects of Query Processing in Parallel Database Systems
This paper reports ongoing work in developing a query representation method for the implementation of dynamic and parallel query processing in database systems. We present Stream Processing based Query Representation | a concept derived from software engineering | as powerful approach, which covers query representation from high-level query declaration to low-level procedural (parallel) executi...
متن کاملNon-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملAQuES: An Agent-based Query Evaluation System
Optimization for distributed and parallel database systems is an overly complex problem. This complexity arises due to the various kinds of parallelism and the coexistence of heterogeneous hardware modules. The query optimizers for those systems must exploit parallel algorithms for algebra operators, independent data parallelism and resource scheduling. In addition, unexpected deviations of the...
متن کاملOn Optimal Pipeline Processing in Parallel Query Execution
A key assumption underlying query optimization schemes for parallel processing is that their cost models can deal with the multitude of e ects encountered during the execution phase. Unfortunately, this is rarely the case and the optimal processing is only achieved in a few situations. In this paper we address the problem to achieve optimal processing under a pipelined execution strategy. The a...
متن کاملQuery Optimization for Parallel Execution
Parallel query processing has received a lot of attention in the database community because customer applications on databases are growing in size and complexity with an ever increasing demand for performance. The main objective of parallel query processing is to achieve speedup, scaleup and high throughput. Parallel machines are necessary for achieving the speedup, however eecient resource uti...
متن کاملFrom the modeling of parallel query processing to the query optimization and simulation
This paper presents a novel theoretical model for representing parallel relational query processing. It is based on a hierarchical approach. First, a scheme graph, called DPL graph, describes all possible execution dependencies between operators, including communication and run-time control mechanisms. Second, a high-level Petri net is used for modeling the data-and control ow. Our model provid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008